Logical Foundations for Hybrid Type-Logical Grammars
نویسندگان
چکیده
This paper explores proof-theoretic aspects of hybrid type-logical grammars, a logic combining Lambek grammars with lambda grammars. We prove some basic properties the calculus, such as normalisation and subformula property also present both sequent proof net calculus for In addition to clarifying logical foundations current study opens way variants extensions original system, including but not limited non-associative version multimodal incorporating structural rules unary modes.
منابع مشابه
Logical Grammars, Logical Theories
Residuated lattices form one of the theoretical backbones of the Lambek Calculus as the standard free models. They also appear in grammatical inference as the syntactic concept lattice, an algebraic structure canonically defined for every language L based on the lattice of all distributionally definable subsets of strings. Recent results show that it is possible to build representations, such a...
متن کاملLearnability of type-logical grammars
A procedure for learning a lexical assignment together with a system of syntactic and semantic categories given a fixed type-logical grammar is briefly described. The logic underlying the grammar can be any cut-free decidable modally enriched extension of the Lambek calculus, but the correspondence between syntactic and semantic categories must be constrained so that no infinite set of categori...
متن کاملUnderspecification in Type-Logical Grammars
Abstract. We show how in a mixed multimodal categorial framework unary modalities can be used to represent morphosyntactic properties of expressions. The residuation logic for the unary connectives, is used to define a feature checking procedure. Each mode represents some morphosyntactic feature. Underspecification is dealt with by assuming general modes that are related to specific instances b...
متن کاملSwitch Graphs for Parsing Type Logical Grammars
Parsing in type logical grammars amounts to theorem proving in a substructural logic. This paper takes the proof net presentation of Lambek’s associative calculus as a case study. It introduces switch graphs for online maintenance of the Danos-Regnier acyclicity condition on proof nets. Early detection of Danos-Regnier acyclicity violations supports early failure in shift-reduce parsers. Normal...
متن کاملFormalising Type-Logical Grammars in Agda
In recent years, the interest in using proof assistants to formalise and reason about mathematics and programming languages has grown. Type-logical grammars, being closely related to type theories and systems used in functional programming, are a perfect candidate to next apply this curiosity to. The advantages of using proof assistants is that they allow one to write formally verified proofs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2022
ISSN: ['1572-9583', '0925-8531']
DOI: https://doi.org/10.1007/s10849-021-09348-5